ILU preconditioning based on the FAPINV algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating the Hybrid Monte Carlo algorithm with ILU preconditioning

The pseudofermion action of the Hybrid Monte Carlo (HMC) algorithm for dynamical fermions is modified to directly incorporate Incomplete LU (ILU) factorisation. This reduces the stochastic noise and allows a larger molecular dynamics step-size to be taken, cutting the computational cost. Numerical tests using the two-flavour Schwinger model are presented, where a two-step ILU preconditioning of...

متن کامل

Orderings for ILU Preconditioning of Nonsymmetric Problems

Numerical experiments are presented whereby the eeect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are diierent variants of incomplete factorizations. It is shown that reorderings for direct methods, such as Reverse Cuthill-McKee and Minimum Degree, can be very beneeci...

متن کامل

Ilu Preconditioning with a Ll Drop Strategy Based on Strongly Connected Components

A class of incomplete LU-factorizations with a new strategy to discard ll for large sparse systems of equations, is presented. The speciic incomplete decomposition presented in this paper allows for a user speciied number of tasks to be performed in parallel. For testing the parallel eeciency as well as the preconditioning eeciency of this decomposition a number of test problems are solved usin...

متن کامل

Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning

Incomplete LU factorization (ILU) techniques are a well-known class of preconditioners, often used in conjunction with Krylov accelerators for the iterative solution of linear systems of equations. However, for certain problems, ILU factorizations can yield factors that are unstable, and in some cases quite dense. Reordering techniques based on permuting the matrix prior to performing the facto...

متن کامل

Finding Exact and Approximate Block Structures for ILU Preconditioning

Sparse matrices which arise in many applications often possess a block structure which can be exploited in iterative and direct solution methods. These block-matrices have as their entries small dense blocks with constant or variable dimensions. Block versions of incomplete LU factorizations which have been developed to take advantage of such structures give rise to a class of preconditioners t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Opuscula Mathematica

سال: 2015

ISSN: 1232-9274

DOI: 10.7494/opmath.2015.35.2.235